Observational Logic
نویسندگان
چکیده
We present an institution of observational logic suited for state-based systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required to be compatible with the indistinguishability relation determined by the given observers. In particular, we introduce a homomorphism concept for observational algebras which adequately expresses observational relationships between algebras. Then we consider a flexible notion of observational signature morphism which guarantees the satisfaction condition of institutions w.r.t. observational satisfaction of arbitrary first-order sentences. From the proof theoretical point of view we construct a sound and complete proof system for the observational consequence relation. Then we consider structured observational specifications and we provide a sound and complete proof system for such specifications by using a general, institution-independent result of [6].
منابع مشابه
Toward Observational Equivalences for Linear Logic Concurrent Constraint Languages
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...
متن کاملObservational equivalences for linear logic concurrent constraint languages
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...
متن کاملModifying Logic of Discovery for Dealing with Domain Knowledge in Data Mining
Logic of discovery was developed in 1970’s as an answer to questions ”Can computers formulate and justify scientific hypotheses?” and ”Can they comprehend empirical data and process it rationally, using the apparatus of modern mathematical logic and statistics to try to produce a rational image of the observed empirical world?”. Logic of discovery is based on observational and theoretical langu...
متن کاملObservational logic, constructor-based logic, and their duality
Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of datatype constructors. In this paper we first reconsider the observational logic institution which provides a logical framework f...
متن کاملCharacterization, definability and separation via saturated models
Three important results about the expressivity of a modal logic L are the Characterization Theorem (that identifies a modal logic L as a fragment of a better known logic), the Definability theorem (that provides conditions under which a class of L-models can be defined by a formula or a set of formulas of L), and the Separation Theorem (that provides conditions under which two disjoint classes ...
متن کاملObservable Behaviors and Equivalences ofLogic
We rst introduce a general semantic scheme for logic programs which provides a uniform framework for deening diierent compositional semantics parametrically wrt a given notion of observability. The equivalence of the operational (top-down) and xpoint (bottom-up) construction of the semantics is ensured by the scheme (provided a congruence property is veriied). We then deene several observationa...
متن کامل